A Trace Logic for Local Security Properties
نویسندگان
چکیده
We propose a new simple trace logic that can be used to specify local security properties, i.e. security properties that refer to a single participant of the protocol specification. Our technique allows a protocol designer to provide a formal specification of the desired security properties, and integrate it naturally into the design process of cryptographic protocols. Furthermore, the logic can be used for formal verification. We illustrate the utility of our technique by exposing new attacks on the well studied protocol TMN. Revision history: Nov 5 2004. Comments: fixed typos.
منابع مشابه
A Machine Checkable Logic of Knowledge for Specifying Security Properties of Electronic Commerce Protocols
A number of researchers have proposed various tools for checking security protocols. Most of these tools work by comparing the set of possible traces (as expressed by some model of computation) to the set of correct traces (often expressed as a set of relationships between events in a trace). In this paper we propose a new logic of knowledge in which one can express relationships between events...
متن کاملDistributed Monitoring in Ad Hoc Networks: Conformance and Security Checking
Ad hoc networks are exposed more than traditional networks to security threats due to their mobility and open architecture aspects. In addition, any dysfunction due to badly con gured nodes can severely a ect the network as all nodes participate in the routing task. For these reasons, it is important to check the validity of ad hoc protocols, to verify whether the running implementation is conf...
متن کاملFormal Proofs of Cryptographic Security of Network Protocols a Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
Present-day internet users and networked enterprises rely on key management and related protocols that use cryptographic primitives. In spite of the staggering financial value of, say, the total number of credit card numbers transmitted by SSL/TLS in a day, we do not have correctness proofs that respect cryptographic notions of security for many of these relatively simple distributed programs. ...
متن کاملExecution Trace Analysis Using LTL-FO ^+
We explore of use of the tool BeepBeep, a monitor for the temporal logic LTL-FO+, in interpreting assembly traces, focusing on security-related applications. LTL-FO+ is an extension of LTL, which includes first order quantification. We show that LTL-FO+ is a sufficiently expressive formalism to state a number of interesting program behaviors, and demonstrate experimentally that BeepBeep can eff...
متن کاملLocal safety and local liveness for distributed systems
We introduce local safety and local liveness for distributed systems whose executions are modeled by Mazurkiewicz traces. We characterize local safety by local closure and local liveness by local density. Restricting to first-order definable properties, we prove a decomposition theorem in the spirit of the separation theorem for linear temporal logic. We then characterize local safety and local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 118 شماره
صفحات -
تاریخ انتشار 2005